Conceptual Design Technique Employing Graph Theoretic Duality

نویسنده

  • Daniel RUBIN
چکیده

The work reported in the paper employs a general approach of associating engineering domains with general discrete mathematical models, called – graph representations. Once the engineering system is represented by a graph representation, all the reasoning processes upon the system are substituted by a reasoning of a more mathematical nature over the graph representation. Accordingly, graph representations were shown to be a unified mathematical framework for a variety of engineering domains. One of the strongest features of graph representations is the mathematical duality relation between their different types. It was proved in the previous works that duality relations between the representations, yield relations between engineering systems belonging to similarly unrelated disciplines. These relations will be employed in this paper to establish an efficient design technique, by means of which existing engineering designs are transformed to related engineering disciplines. The idea behind the technique introduced in the paper is first to transform the given design problem to a problem in its dual engineering domain. Then, if a solution exists in the dual domain, it is transformed back to the original engineering domain, yielding the solution to the original problem. This technique has already been applied to solve diverse design problems. The paper introduces two design cases, involving the fields of machine theory, structures and MEMS.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

From Entity Relationship to XML Schema: A Graph-Theoretic Approach

We propose a mapping from the Enhanced Entity Relationship conceptual model to the W3C XML Schema Language with the following properties: information and integrity constraints are preserved, no redundance is introduced, different hierarchical views of the conceptual information are available, the resulting XML structure is highly connected, and the design is reversible. We investigate two diffe...

متن کامل

Exact annihilating-ideal graph of commutative rings

The rings considered in this article are commutative rings with identity $1neq 0$. The aim of this article is to define and study the exact annihilating-ideal graph of commutative rings. We discuss the interplay between the ring-theoretic properties of a ring and graph-theoretic properties of exact annihilating-ideal graph of the ring.

متن کامل

There Is No Finite-infinite Duality Pair - Forming Antichains - in the Digraph Poset

Let D denote the partially ordered sets of homomorphism classes of finite directed graphs, ordered by the homomorphism relation. Order theoretic properties of this poset have been studied extensively, and have interesting connections to familiar graph properties and parameters. This paper studies the generalized duality pairs in D: it gives a new, short proof for the Foniok Nešetřil Tardif theo...

متن کامل

A note on a graph related to the comaximal ideal graph of a commutative ring

  ‎The rings considered in this article are commutative with identity which admit at least two maximal ideals‎.  ‎This article is inspired by the work done on the comaximal ideal graph of a commutative ring‎. ‎Let R be a ring‎.  ‎We associate an undirected graph to R denoted by mathcal{G}(R)‎,  ‎whose vertex set is the set of all proper ideals I of R such that Inotsubseteq J(R)‎, ‎where J(R) is...

متن کامل

Some results on a supergraph of the comaximal ideal graph of a commutative ring

Let R be a commutative ring with identity such that R admits at least two maximal ideals. In this article, we associate a graph with R whose vertex set is the set of all proper ideals I of R such that I is not contained in the Jacobson radical of R and distinct vertices I and J are joined by an edge if and only if I and J are not comparable under the inclusion relation. The aim of this article ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006